Circuit complexity and 2D bosonisation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polymorphisms and Circuit Complexity

We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function f is characterized by the partial polymorphisms of f ’s truth table. Moreover, the non-deterministic circuit complexity of f is characterized by the polymorphisms of f ’s truth table.

متن کامل

Circuit Complexity

Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...

متن کامل

Arithmetic Circuit Complexity and Motion

This dissertation presents the results of my research in two areas: parallel algorithms/circuit complexity, and algorithmic motion planning. The chapters on circuit complexity examine the parallel complexity of several fundamental problems (such as integer division) in the model of small depth circuits. In the later chapters on motion planning, we turn to the computationally intensive problem o...

متن کامل

Quantum Circuit Complexity

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines ...

متن کامل

Circuit Complexity of Shuffle

We show that Shuffle(x, y, w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC, but it is in AC. The fact that shuffle is not in AC is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84], while the fact that it is in AC is implicit in the results of [Man82a]. Together, the two results p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2019

ISSN: 1029-8479

DOI: 10.1007/jhep10(2019)276